Rational Approximation with Varying Weights III
نویسندگان
چکیده
منابع مشابه
Rational approximation with varying weights in the complex plane
Given an open bounded set G in the complex plane and a weight function W (z) which is analytic and di erent from zero in G, we consider the problem of locally uniform rational approximation of any function f(z), which is analytic in G, by particular ray sequences of weighted rational functions of the form Wm+n(z)Rm;n(z), where Rm;n(z) = Pm(z)=Qn(z); with deg Pm m and degQn n: The main result of...
متن کاملConstrained Approximation with Jacobi Weights
In this paper, we prove that for l = 1 or 2 the rate of best l-monotone polynomial approximation in the Lp norm (1 ≤ p ≤ ∞) weighted by the Jacobi weight wα ,β(x) ∶= (1 + x)α(1 − x)β with α, β > −1/p if p <∞, or α, β ≥ 0 if p =∞, is bounded by an appropriate (l + 1)-st modulus of smoothness with the same weight, and that this rate cannot be bounded by the (l+2)-ndmodulus. Related results on con...
متن کاملVarying weights for orthogonal polynomials with monotonically varying recurrence coefficients
and the coefficients in (1.3), which depend on the parameter N , {an,N : bn,N}n=0, bn,N > 0. ∗The authors acknowledge support from NATO Collaborative linkage grant PST.CLG.979738 and INTAS Research Network 03-51-6637. The first author was supported by grants RFBR-05-01-00522, NSh1551.2003.1, Program No. 1 DMS RAS. The second author was supported by an NSF grant. The third author was supported b...
متن کاملSets of exact approximation order by rational numbers III
For a function Ψ : R>0 → R>0, let Exact(Ψ) be the set of real numbers that are approximable by rational numbers to order Ψ, but to no order cΨ with 0 < c < 1. When Ψ is non-increasing and satisfies Ψ(x) = o(x−2), we establish that Exact(Ψ) has Hausdorff dimension 2/λ, where λ is the lower order at infinity of the function 1/Ψ. Furthermore, we study the set Exact(Ψ) when Ψ is not assumed to be n...
متن کاملIterative Partitioning with Varying Node Weights
The balanced partitioning problem divides the nodes of a [hyper]graph into groups of approximately equal weight (i.e., satisfying balance constraints) while minimizing the number of [hyper]edges that are cut (i.e., adjacent to nodes in di erent groups). Classic iterative algorithms use the pass paradigm [24] in performing single-node moves [16, 13] to improve the initial solution. To satisfy pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 2000
ISSN: 0021-9045
DOI: 10.1006/jath.1999.3406